Reachback communication in wireless sensor networks
نویسنده
چکیده
This dissertation is concerned with a communications scenario in which a large number of sensor nodes, deployed on a field, take local measurements of some physical process and cooperate to send back the collected data to a far receiver. The first part considers the problem of communicating multiple correlated sources over independent channels and with partial cooperation among encoders, and provides a set of coding theorems that give a complete characterization of the conditions on the sources and the channels under which reliable communication is possible. A key insight from these results is that for a large class of networks separate source and channel coding provides an optimal system architecture. The second part presents new contributions for the long-standing multiterminal source coding problem. Finally, the third part assumes that the sensor nodes use very simple encoders and focuses on the design of practical decoding algorithms under given complexity constraints. Zusammenfassung Diese Arbeit betrachtet einige Aspekte der Kommunikation zwischen verteilten Sensorknoten, die gemessene Werte versenden, und einem entfernten Empfänger, der die Daten weiterverarbeitet. Zuerst werden die theoretischen Grenzen für die kooperative Übertragung von korrelierten Quellen über statistisch unabhängige Kanäle bestimmt. Dies erfolgt durch eine Reihe von Codierungstheoremen, die hinreichende und notwendige Bedingungen für nahezu fehlerfreie Kommunikation angeben. Eine wichtige Erkenntnis dieser Arbeit ist, dass für viele nicht triviale Netzwerke getrennte Quellenund Kanalcodierung eine optimale Systemarchitektur anbietet. Als zweiter Schritt wird eine Verzerrung der Daten mitberücksichtigt, was zu einem lange offenen Problem der Rate-Distortion Theorie führt. Auch hierfür werden neue Ergebnisse präsentiert. Der letzte Teil der Arbeit beschäftigt sich mit dem Entwurf von praktischen Decodierungsalgorithmen unter Einschränkung der algorithmischen Komplexität.
منابع مشابه
Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملRouting Hole Handling Techniques for Wireless Sensor Networks: A Review
A Wireless Sensor Network consists of several tiny devices which have the capability to sense and compute the environmental phenomenon. These sensor nodes are deployed in remote areas without any physical protections. A Wireless Sensor Network can have various types of anomalies due to some random deployment of nodes, obstruction and physical destructions. These anomalies can diminish the sensi...
متن کاملA Priority-based Routing Algorithm for Underwater Wireless Sensor Networks (UWSNs)
Advances in low-power electronics design and wireless communication have enabled the development of low cost, low power micro-sensor nodes. These sensor nodes are capable of sensing, processing and forwarding which have many applications such as underwater networks. In underwater wireless sensor networks (UWSNs) applications, sensors which are placed in underwater environments and predicted ena...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملTarget Tracking with Unknown Maneuvers Using Adaptive Parameter Estimation in Wireless Sensor Networks
Abstract- Tracking a target which is sensed by a collection of randomly deployed, limited-capacity, and short-ranged sensors is a tricky problem and, yet applicable to the empirical world. In this paper, this challenge has been addressed a by introducing a nested algorithm to track a maneuvering target entering the sensor field. In the proposed nested algorithm, different modules are to fulfill...
متن کامل3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004